An Optimal Routing Problem for Sightseeing and its Solution
نویسندگان
چکیده
منابع مشابه
An Iterative Solution to the Optimal Premium-Class Routing Problem
This paper studies the problem of finding optimal routes for the premium-class traffic such that (1) it works correctly in the context of hop-by-hop routing for DiffServ networks; and (2) it maximizes the residual bandwidth on those bottleneck links so that the negative influences imposed by the premium traffic onto the best-effort traffic are minimized. This problem is called the Optimal Premi...
متن کاملOne-for-One Period Policy and its Optimal Solution
In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...
متن کاملA New Approach for Finding an Optimal Solution for Grey Transportation Problem
In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...
متن کاملCooperative vehicle routing problem: an opportunity for cost saving
In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2004
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.124.1507